Performance Analysis of Heuristic Techniques for Optimization of Routing in Distributed Sensor Networks

Distributed Sensor Networks (DSN) consists of distributed nodes having the capability of sensing, computation and wireless communications. Routing, power management and data dissemination protocols have been specifically designed for DSN, where energy consumption is an essential design issues for routing. Maximizing the lifetime of the sensor nodes, it is preferable to distribute the energy dissipated throughout the sensor network in order to minimize the maintenance and maximize overall system performance. Optimization of routing method is an essential for routing in DSN because long communication distances between distributed sensor nodes and sink node in a network can greatly drain the energy of sensors and decrease the lifetime of the network. Our objective is to optimization of routing is used to maximize the network life time and improve the energy efficiency using heuristic techniques. This paper aims to evaluate the performance of GA and TS heuristic techniques are used to solve the optimization of routing in DSN. Both algorithms are evaluated with regard to the performance of search success rate, energy utilization and time complexity in distributed sensor environment. Therefore, TS method can produce better performance of optimization of routing than the GA approach even at better execution time in an environment. Finally, we have evaluated the performance parameters for the proposed scheme.